Repetitions and permutations of columns in the semijoin algebra

نویسندگان

  • Dirk Leinders
  • Jan Van den Bussche
چکیده

Codd defined the relational algebra [3, 4] as the algebra with operations projection, join, restriction, union and difference. His projection operator can drop, permute and repeat columns of a relation. This permuting and repeating of columns does not really add expressive power to the relational algebra. Indeed, using the join operation, one can rewrite any relational algebra expression into an equivalent expression where no projection operator permutes or repeats columns. The fragment of the relational algebra known as the semijoin algebra, however, lacks a full join operation. Nevertheless, we show that any semijoin algebra expression can still be simulated in a natural way by a set of expressions where no projection operator permutes or repeats columns. 1991 Mathematics Subject Classification. 68P15.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the expressive power of semijoin queries

The semijoin algebra is the variant of the relational algebra obtained by replacing the join operator by the semijoin operator. We provide an Ehrenfeucht-Fraissé game, characterizing the discerning power of the semijoin algebra. This game gives a method for showing that queries are not expressible in the semijoin algebra.

متن کامل

The semijoin algebra and the guarded fragment

The semijoin algebra is the variant of the relational algebra obtained by replacing the join operator by the semijoin operator. We discuss some interesting connections between the semijoin algebra and the guarded fragment of first-order logic. We also provide an Ehrenfeucht-Fräıssé game, characterizing the discerning power of the semijoin algebra. This game gives a method for showing that certa...

متن کامل

The Semijoin Algebra

When we replace, in the classical relational algebra, the join operator by the semijoin operator, we obtain what we call the semijoin algebra. We will show that, when only equi-joins are used, the semijoin algebra is equivalent with the guarded fragment of first-order logic, and thus it inherits many of the nice properties of the latter logic. When more general theta-joins are used, however, we...

متن کامل

Investigating the 2-way Semijoin for Distributed Query Optimization

With increased globalization, most databases are now highly distributed. Thus, there is a need to reduce the cost of queries that require data from several locations. In the literature, the semijoin is the most commonly used operation for the reduction phase of any distributed query optimization strategy. In [7] an improvement, called the 2-way semijoin, is proposed. The authors conclude that t...

متن کامل

Optimizing Entity Join Queries by Extended Semijoins in a Wide Area Multidatabase Environment

In this paper we consider processing entity join queries in a wide area multidatabase environmen t where the query processing cost is dominated by the cost of data transmission An entity join oper ation integrates tuples representing the same en tities from di erent relations in which inconsistent data may exist The semijoin technique has been successfully used in a distributed database system ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ITA

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2009